TR-2012003: Root-Finding and Root-Refining for a Polynomial Equation
نویسنده
چکیده
Polynomial root-finders usually consist of two stages. At first a crude approximation to a root is slowly computed; then it is much faster refined by means of the same or distinct iteration. The efficiency of computing an initial approximation resists formal study, and the users rely on empirical data. In contrast, the efficiency of refinement is formally measured by the classical concept q where q denotes the convergence order, whereas d denotes the number of function evaluations per iteration. In our case of a polynomial of a degree n we use 2n arithmetic operations per its evaluation of at a point. Noting this we extend the definition to cover iterations that are not reduced to function evaluations alone, including iterations that simultaneously refine n approximations to all n roots of a degree n polynomial. By employing two approaches to the latter task, both based on recursive polynomial factorization, we yield refinement with the efficiency 2, d = cn/ log n for a positive constant c. For large n this is a dramatic increase versus the record efficiency 2 of refining an approximation to a single root of a polynomial. The advance could motivate practical use of the proposed root-refiners.
منابع مشابه
Root-finding and Root-refining for a Polynomial Equation
Polynomial root-finders usually consist of two stages. At first a crude approximation to a root is slowly computed; then it is much faster refined by means of the same or distinct iteration. The efficiency of computing an initial approximation resists formal study, and the users rely on empirical data. In contrast, the efficiency of refinement is formally measured by the classical concept q whe...
متن کاملTR-2011004: Acceleration of Newton's Polynomial Factorization: Army of Constraints, Convolution, Sylvester Matrices, and Partial Fraction Decomposition
We try to arm Newton’s iteration for univariate polynomial factorization with greater convergence power by shifting to a larger basic system of multivariate constraints. The convolution equation is a natural means for a desired expansion of the basis for this iteration versus the classical univariate method, which is more vulnerable to foreign distractions from its convergence course. Compared ...
متن کاملTR-2011003: Partial Fraction Decomposition, Sylvester Matrices, Convolution and Newton's Iteration
Both Sylvester matrix and convolution are defined by two polynomials. If one of them has small degree, then the associated Sylvester linear system can be solved fast by using its PFD interpretation of the convolution equation. This can immediately simplify the refinement of approximate convolution by means of Newton’s iteration, where we also incorporate the PFD refinement techniques or alterna...
متن کاملTR-2014011: Real Polynomial Root-Finding: New Advances
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial has no nonreal roots, but typically nonreal roots are much more numerous than the real ones. We dramatically accelerate the known algorithms in this case by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016